A Wolf Colony Search Algorithm Based on the Complex Method for Uninhabited Combat Air Vehicle Path Planning
نویسندگان
چکیده
Path planning for uninhabited combat air vehicle (UCAV) is a class of complicated high dimensional optimization problem, which mainly centralizes on path planning considering the different kinds of constrains in the complex environment of war. In order to solve this problem, it is converted to a kind of constrained function optimization problem, and a wolf colony search algorithm based on the complex method is proposed, which combines the complex method with a wolf colony search algorithm, and it solves the problem of UCAV path planning successfully. The experiment results show that our proposed algorithm is feasible and effective to solve the problem of UCAV path planning.
منابع مشابه
Unmanned Aerial Vehicle Path Planning Based on Tlbo Algorithm
Path planning of unmanned aerial vehicle (UAV) is an optimal problem in the complex combat field environment. Teaching-Learning-Based Optimization (TLBO) algorithm is presented under the inspiration of the teaching-learning behavior in a classroom. In this paper, this algorithm is applied to design a path by the search angle and distance, by which a better path at higher convergence speed and s...
متن کاملA Bat Algorithm with Mutation for UCAV Path Planning
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is propose...
متن کاملA Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning
Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV thr...
متن کاملA Modified Firefly Algorithm for UCAV Path Planning
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original firefly algorithm (FA) is used to solve the UCAV path planning problem. Furthermore, a new modified firefly algorithm (MFA) is prop...
متن کاملSolving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods
An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non...
متن کامل